reachability graph meaning in Chinese

可达图

For quantitative solution , we study gspn and find that the reachability graph of a gspn is isomorphic to a continuous time markov process ( ctmp ) when the vanishing markings are eliminated , so markov process method can be used
在安全性定量分析方面，我们研究发现去除消失标识后， gspn的可达图与一个连续时间markov过程( ctmp )是同构的，为此，可利用markov过程方法进行分析。
Then the methods using reachability graph to analyze static and dynamic structural performance of colored timed workflow net are improved , and the theorem verifying whether there are deadlocks or traps in concurrent workflow are put forward using reachability graph
通过可达图分析着色时间工作流网静态和动态性能,提出用可达图检验工作流中是否存在死锁和陷阱的判断定理。
Three necessary conditions on the parameters are derived , and then a reduced reachability graph is obtained by applying the necessary conditions to lessen the combinatorial state explosion . and these dynamic characteristics to this model are verified preliminarily using the reduced reachability graph
根据本文提出的可达分析技术，推导出了保证协议正确操作的参数间的时间关系，根据该时间关系，我们得到了所建模型的简化的可达标识图，并对该模型的动态特性进行了初步分析。